Length estimators for digitized contours

نویسندگان

  • Leo Dorst
  • Arnold W. M. Smeulders
چکیده

The estimation of the length of a continuous curve from discrete data is considered. For ideal straight chaincode strings, optimal estimators are given. Comparisons are performed with known methods and recommendations given. A sampling density vs. accuracy trade-off theorem is presented. The applicability to nonstraight strings is discussed. For curves that may be considered to be composed of circular arcs good length estimators are found. 9 1987 Academic Press, Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chain Code Probabilities and Optimal LengthEstimators for Digitized Three

Length estimation of three dimensional digitized curves is considered. Three dimensional 26-directional chain code representation is assumed. Recent results on 3 ? D Euclidean Distance Maps are inapplicable to optimal 3 ? D length estimation. To support optimal design of three dimensional length estimators, chain code probabilities in three dimensional chain encoded digital straight lines are d...

متن کامل

Curvature estimation along noisy digital contours by approximate global optimization

In this paper we introduce a new curvature estimator along digital contours, that we called Global Min-Curvature estimator (GMC). As opposed to previous curvature estimators, it considers all the possible shapes that are digitized as this contour, and selects the most probable one with a global optimization approach. The GMC estimator exploits the geometric properties of digital contours by usi...

متن کامل

Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs

We propose in this paper a new curvature estimator based on the set of maximal digital circular arcs. For strictly convex shapes with continuous curvature fields digitized on a grid of step h, we show that this estimator is mutligrid convergent if the discrete length of the maximal digital circular arcs grows in Ω(h− 1 2 ). We indeed observed this order of magnitude. Moreover, experiments showe...

متن کامل

About Multigrid Convergence of Some Length Estimators

An interesting property for curve length digital estimators is the convergence toward the continuous length and the associate convergence speed when the digitization step h tends to 0. On the one hand, it has been proved that the local estimators do not verify this convergence. On the other hand, DSS and MLP based estimators have been proved to converge but only under some convexity and smoothn...

متن کامل

Comparing the performance of length estimators by Implementation the vertex chain code

Chain code is fundamental for many applications in image analysis and pattern recognition, because it reduces the amount of stored data and preserves the maintenance of data. The most famous chain code which applied in many applications is Freeman chain code. One of the other kinds of chain code is the Vertex Chain Code (VCC).The VCC proposed by Bribiesca and it has some preferences such as sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Vision, Graphics, and Image Processing

دوره 40  شماره 

صفحات  -

تاریخ انتشار 1987